Programming Computable Functions

Results: 25



#Item
11MFPSSemi-decidability of may, must and probabilistic testing in a higher-type setting Mart´ın Escard´o

MFPSSemi-decidability of may, must and probabilistic testing in a higher-type setting Mart´ın Escard´o

Add to Reading List

Source URL: www.cs.bham.ac.uk

Language: English - Date: 2009-05-12 05:48:53
12ProofPower  DESCRIPTION PPTex-2.9.1w2.rda[removed]c : Lemma 1 Ltd. 2006

ProofPower DESCRIPTION PPTex-2.9.1w2.rda[removed]c : Lemma 1 Ltd. 2006

Add to Reading List

Source URL: www.lemma-one.com

Language: English - Date: 2011-07-27 09:29:49
13“Types are the leaven of computer programming: they make it digestible.” - R. Milner Types à la Milner Benjamin C. Pierce

“Types are the leaven of computer programming: they make it digestible.” - R. Milner Types à la Milner Benjamin C. Pierce

Add to Reading List

Source URL: www.cis.upenn.edu

Language: English - Date: 2012-04-17 18:53:47
14ProofPower  TUTORIAL PPTex-2.9.1w2.rda[removed]c : Lemma 1 Ltd. 2006

ProofPower TUTORIAL PPTex-2.9.1w2.rda[removed]c : Lemma 1 Ltd. 2006

Add to Reading List

Source URL: www.lemma-one.com

Language: English - Date: 2011-07-27 09:29:49
15Functional languages / Procedural programming languages / Logic in computer science / Isabelle / ML / OCaml / Lawrence Paulson / Logic for Computable Functions / Programming language / Software engineering / Computing / Computer programming

PDF Document

Add to Reading List

Source URL: isabelle.in.tum.de

Language: English - Date: 2014-08-27 06:04:04
16The complexity of real recursive functions Manuel Lameiras Campagnolo D.M./I.S.A., Universidade T´ecnica de Lisboa, Tapada da Ajuda, [removed], Lisboa, Portugal; C.L.C./D.M./I.S.T., Universidade T´ecnica de Lisboa, Av.

The complexity of real recursive functions Manuel Lameiras Campagnolo D.M./I.S.A., Universidade T´ecnica de Lisboa, Tapada da Ajuda, [removed], Lisboa, Portugal; C.L.C./D.M./I.S.T., Universidade T´ecnica de Lisboa, Av.

Add to Reading List

Source URL: wslc.math.ist.utl.pt

Language: English - Date: 2003-02-11 11:10:46
17Gradual Typing for Functional Languages Jeremy G. Siek Walid Taha  University of Colorado

Gradual Typing for Functional Languages Jeremy G. Siek Walid Taha University of Colorado

Add to Reading List

Source URL: www.cs.colorado.edu

Language: English - Date: 2006-08-29 17:25:52
18Full Abstraction for PCF1 Samson.Abramsky2 University of Edinburgh and Radha Jagadeesan3

Full Abstraction for PCF1 Samson.Abramsky2 University of Edinburgh and Radha Jagadeesan3

Add to Reading List

Source URL: www.cs.ox.ac.uk

Language: English - Date: 2004-01-06 12:23:12
19Gradual Typing for Functional Languages Jeremy G. Siek Walid Taha  University of Colorado

Gradual Typing for Functional Languages Jeremy G. Siek Walid Taha University of Colorado

Add to Reading List

Source URL: scheme2006.cs.uchicago.edu

Language: English - Date: 2006-08-29 21:53:24
20Multiversal Polymorphic Algebraic Theories — Syntax, Semantics, Translations, and Equational Logic —

Multiversal Polymorphic Algebraic Theories — Syntax, Semantics, Translations, and Equational Logic —

Add to Reading List

Source URL: www.cl.cam.ac.uk

Language: English - Date: 2013-04-24 15:15:34